package com.scheuk.euler;

public class p001 {

	/* If we list all the natural numbers below 10 that are multiples of 3 or 5, 
	 * we get 3, 5, 6 and 9. The sum of these multiples is 23.
	 * Find the sum of all the multiples of 3 or 5 below 1000.
	 */
	static void Problem1(int value)
	{
		long sT = System.currentTimeMillis();
		long sum = 0;
		//takes O(n) time
		for (int j = 1; j < value; j++)
		{
			if ( ((j%3) == 0) || ((j%5) == 0 ) ) { 
				sum+=j;
			}
		}
		long eT = System.currentTimeMillis();
		System.out.println("sum is: " + sum);
		System.out.println("total time: " + (eT-sT) + " ms");
	}
	
}
